منابع مشابه
Do all fragments count?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing (DOP). Experiments with the Penn Wall Street Journal (WSJ) treebank show that counts of almost arbitrary fragments within parse trees are important, leading to improved parse accuracy over previous models tested on this treebank. We isolate a number of dependency relations which previou...
متن کاملShould all choices count
Should we give equal weight to all responses in a choice experiment? Previous Choice Modelling papers have considered the issue of the internal consistency of choices – such as the extent to which strictly-dominated options are chosen. In this paper, a different focus is employed, namely the extent to which people choose options which violate their stated upper or lower limits for the acceptabl...
متن کاملAddressing node failures in all-optical networks
We investigate the effectiveness of link-protection schemes in terms of their ability to handle node failures in all-optical networks. We focus on node recovery, using a ring-based scheme (double-cycle cover; DCC) and generalized loopback. Comparisons are made by introduction of metrics that measure a protection scheme’s effectiveness in handling node failures. We also introduce measures that q...
متن کاملAll Fragments Count in Parser Evaluation
PARSEVAL, the default paradigm for evaluating constituency parsers, calculates parsing success (Precision/Recall) as a function of the number of matching labeled brackets across the test set. Nodes in constituency trees, however, are connected together to reflect important linguistic relations such as predicate-argument and direct-dominance relations between categories. In this paper, we presen...
متن کاملThe Do-All Problem with Byzantine Processor Failures
Do-All is the abstract problem of using n processors to cooperatively perform m independent tasks in the presence of failures. This problem and its derivatives have been a centerpiece in the study of trade-offs between efficiency and fault-tolerance in cooperative computing environments. Many algorithms have been developed for Do-All in various models of computation, including message-passing, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pain Medicine
سال: 2015
ISSN: 1526-2375,1526-4637
DOI: 10.1111/pme.12638